case constraint

case constraint
ограничение конкретной задачей

coverage constraint — ограничение по охвату

hardware constraint — аппаратное ограничение

landing constraint — ограничение при посадке

financial constraint — финансовое ограничение

scheduling constraint — ограничение на график


English-Russian big polytechnic dictionary. 2014.

Игры ⚽ Поможем написать реферат

Смотреть что такое "case constraint" в других словарях:

  • Constraint satisfaction problem — Constraint satisfaction problems (CSP)s are mathematical problems defined as a set of objects whose state must satisfy a number of constraints or limitations. CSPs represent the entities in a problem as a homogeneous collection of finite… …   Wikipedia

  • Constraint programming — Programming paradigms Agent oriented Automata based Component based Flow based Pipelined Concatenative Concurrent computin …   Wikipedia

  • Constraint Grammar — (CG) is a methodological paradigm for Natural language processing (NLP). Linguist written, context dependent rules are compiled into a grammar that assigns grammatical tags ( readings ) to words or other tokens in running text. Typical tags… …   Wikipedia

  • Constraint logic programming — Programming paradigms Agent oriented Automata based Component based Flow based Pipelined Concatenative Concurrent computing …   Wikipedia

  • Constraint satisfaction — In artificial intelligence and operations research, constraint satisfaction is the process of finding a solution to a set of constraints that impose conditions that the variables must satisfy. A solution is therefore a vector of variables that… …   Wikipedia

  • Constraint satisfaction dual problem — The dual problem is a reformulation of a constraint satisfaction problem expressing each constraint of the original problem as a variable. Dual problems only contain binary constraints, and are therefore solvable by algorithms tailored for such… …   Wikipedia

  • Constraint counting — In mathematics, constraint counting is a crude but often useful way of counting the number of free functions needed to specify a solution to a partial differential equation. Contents 1 Einstein strength 1.1 Linear equations 1.2 General solution… …   Wikipedia

  • Decomposition method (constraint satisfaction) — In constraint satisfaction, a decomposition method translates a constraint satisfaction problem into another constraint satisfaction problem that is binary and acyclic. Decomposition methods work by grouping variables into sets, and solving a… …   Wikipedia

  • Budget constraint — A Budget constraint represents the combinations of goods and services that a consumer can purchase given current prices and his income. Consumer theory uses the concepts of a budget constraint and a preference map to analyze consumer choices.… …   Wikipedia

  • First class constraint — In Hamiltonian mechanics, consider a symplectic manifold M with a smooth Hamiltonian over it (for field theories, M would be infinite dimensional). Poisson bracketsSuppose we have some constraints : f i(x)=0, for n smooth functions :{ f i } {i=… …   Wikipedia

  • Concurrent constraint logic programming — is a version of constraint logic programming aimed primarily at programming concurrent processes rather than (or in addition to) solving constraint satisfaction problems. Goals in constraint logic programming are evaluated concurrently; a… …   Wikipedia


Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»